Polynomial Factorization: Sharp Bounds, Efficient Algorithms1
نویسندگان
چکیده
A new coefficient bound is established for factoring univariate polynomials over the integers. Unlike an overall bound, the new bound limits the size of the coefficients of at least one irreducible factor of the given polynomial. The single-factor bound is derived from the weighted norm introduced in Beauzamy et al. (1990) and is almost optimal. Effective use of this bound in p-adic lifting results in a more efficient factorization algorithm. A full example and comparisons with known coefficient bounds are included.
منابع مشابه
Polynomial Factorization Sharp Bounds, Efficient Algorithms
A new coeÆcient bound is established for factoring univariate polynomials over the integers. Unlike an overall bound, the new bound limits the size of the coeÆcients of at least one irreducible factor of the given polynomial. The single-factor bound is derived from the weighted norm introduced in Beauzamy et al. (1990) and is almost optimal. E ective use of this bound in p-adic lifting results ...
متن کاملToric Generalized Characteristic Polynomials
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over an algebraically closed field) of any n by n system of polynomial equations. Since we use the sparse resultant, we thus obtain complexity bounds (for converti...
متن کاملComputing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given polynomial using Rouche's theorem from complex analysis. We compute the error bounds using non-linear optimization. Our bounds are scalable in the sense that we compu...
متن کاملEfficient Identity Testing and Polynomial Factorization over Non-associative Free Rings
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring F{x1, x2, . . . , xn}. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10], and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing (PIT) and polynomial factorization over F{x...
متن کاملLower bounds on matrix factorization ranks via noncommutative polynomial optimization
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogues: the completely positive rank and the completely positive semidefinite rank. We study the convergence properties of o...
متن کامل